Heavy-tailed limits for medium size jobs and comparison scheduling

We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) scheduling disciplines on an event where the job size of a customer arriving in stationarity is smaller than exactly k≥0 out of the preceding m≥k arrivals. Then, conditioning on the preceding event, the sojourn time distribution of this newly arriving customer behaves asymptotically the same as if the customer were served in isolation with a server of rate (1−ρ)/(k+1) for PS/FBPS, and (1−ρ) for SRPT, respectively, where ρ is the traffic intensity. Hence, the introduced notion of conditional limits allows us to distinguish the asymptotic performance of the studied schedulers by showing that SRPT exhibits considerably better asymptotic behavior for relatively smaller jobs than PS/FBPS. Inspired by the preceding results, we propose an approximation to the SRPT discipline based on a novel adaptive job grouping mechanism that uses relative size comparison of a newly arriving job to the preceding m arrivals. Specifically, if the newly arriving job is smaller than k and larger than m−k of the previous m jobs, it is routed into class k. Then, the classes of smaller jobs are served with higher priorities using the static priority scheduling. The good performance of this mechanism, even for a small number of classes m+1, is demonstrated using the asymptotic queueing analysis under the heavy-tailed job requirements. We also discuss refinements of the comparison grouping mechanism that improve the accuracy of job classification at the expense of a small additional complexity. This work is supported by NSF Grant 0615126.     

Queues with Equally Heavy Sojourn Time and Service Requirement Distributions

For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time distribution is heavier than the tail of the service requirement distribution when the latter has a regularly varying tail. In contrast, for the M/G/1 queue with Processor Sharing, Zwart and Boxma [26] showed that under the same assumptions on the service requirement distribution, the two tails are equally heavy. By means of a probabilistic analysis we provide a new insightful proof of this result, allowing for the slightly weaker assumption of service requirement distributions with a tail of intermediate regular variation. The new approach allows us to also establish the tail equivalence for two other service disciplines: Foreground–Background Processor Sharing and Shortest Remaining Processing Time. The method can also be applied to more complicated models, for which no explicit formulas exist for (transforms of) the sojourn time distribution. One such model is the M/G/1 Processor Sharing queue with service that is subject to random interruptions. The latter model is of particular interest for the performance analysis of communication networks.     

Preliminary study of residual orbit oscillation in BEPC Ⅱ

BEPCⅡ has two rings each with an injection system.The injection system of each ring consists of two kicker magnets and a septum magnet.The injection layout of two rings is the same.Both two kickers would kick the beam in horizontal plane.The betatron phase advance in the horizontal plane between two kickers is designed exactly 180° in order to reduce the perturbation to the circulating beams during injection.In fact,the residual orbit oscillation will originate because of the existence of a variety of errors.The Librea Electron BPM processor is used to acquire the beam position data in turn-by-turn mode and to analyze the residual orbit oscillation.According to the measurement results,minimization of the residual orbit oscillation can be done by adjusting the peak field strength and trigger timing delay of two kickers.With very small residual orbit oscillation the two beams can keep collision condition during the injection.     

岛津C－R2A全自动高效液相色谱分析程序的设计

利用Ｃ－Ｒ２Ａ色谱处理机的编程功能，实现了液相色谱法（主机为ＬＣ－４Ａ和ＳＩＬ－２ＡＳ自动进样器）全自动分析，即通过程序实现按设定的样品顺序、进样量、重复次数对样品进行测定，每个样品分析完后，进行数据处理，并打印出结果表     

Head of the line processor sharing for many symmetric queues with finite capacity

In this paper the steady-state behavior of many symmetric queues, under the head of the line processor-sharing discipline, is investigated. The arrival process to each of n queues is Poisson, with rateA, and each queue hasr waiting spaces. A job arriving at a full queue is lost. The queues are served by a single exponential server, which has a mean raten, and splits its capacity equally amongst the jobs at the head of each nonempty queue. The normal traffic casep=/< 1 is considered, and it is assumed thatn1 andr= 0(1). A 2-term asymptotic approximation to the loss probabilityL is derived, and it is found thatL = 0(n ^–r ), for fixedp. If6=(1–p)/p 1, then the approximation is valid if n² 1 and (r+ 1)²n, and in this caseL r!/(n)^r. Numerical values ofL are obtained forr = 1,2,3,4 and 5,n = 1000,500 and 200, and various values ofp< 1. Very small loss probabilities may be obtained with appropriate values of these parameters.     

Ab initio electronic structure theory as an aid to understanding excited state hydrogen transfer in moderate to large systems

Hypocrellin and hypericin are naturally occurring polycyclic perylene quinones, and they have both been found to exhibit photoactivated antiviral and anticancer activity. One mode of action proposed involves excited-state hydrogen transfer. Consequently these compounds have been widely studied using spectroscopic methods, and are found to both absorb and emit in the visible region. Recently an analog dihydroxy perylene quinone was synthesized in order to examine its antiviral activity in relation to the naturally occurring compounds. Its UV-visible absorption and emission spectra are quite different to those of hypocrellin and hypericin, with very weak absorption and no visibility of emission at all. The ab inito excited-state methods, configuration interaction singles (CIS), state-averaged complete active space self-consistent field (SA–CASSCF), and SA-multireference perturbation theory (SA–MRMP2) are used to examine the origin of this different absorption and emission behavior. Owing to the size of these systems (between 24 and 40 heavy atoms) extensive use of parallel processor algorithms was made, especially a parallel atomic orbital-based CIS energy and gradient code developed at the ABCC. The performance of these methods, and possible ,as well as future directions and prospects are discussed.     

机载视觉探测与目标定位系统设计与实现

为了解决GPS(Global Position System)定位精度不够高,无法满足无人机完成货物搬运任务的问题,设计并实现了一种以TMS320DM6437为平台的机载视觉探测与目标定位系统,由机载子系统和地面监视子系统组成。机载视觉信息处理子系统利用圆的几何特性改进了经典的Hough变换圆检测算法,在保证精度的同时大大降低了计算量,提高了算法运行效率。同时设计并实现了区分多个相同目标的方案与算法,其冗余机制增强了方案的可靠性。最后搭建了静目标定位测试平台和动目标定位跟踪机载测试系统,验证了系统的可靠性、鲁棒性、实时性和探测精度。     

单片机在"利用霍尔效应测磁场"实验中的应用

介绍了霍尔元件测磁场实验中的一种软件温度补偿方法,它利用单片机的强大软件功能,原理简单,成本低,精度高,取得了理想的测量和控制效果．     

基于高速同步485总线通信的多通道伺服控制器设计

文章介绍了一种四通道数字伺服控制器的系统设计和实现方案;针对研制任务中高通信波特率和多路控制的要求,设计了以XC164为主控制芯片,基于JS71175型485协议处理器的高速同步485总线通信的多通道伺服控制器,该控制器在提高了同步485通信速率的同时可以实现四路伺服机构的控制、伺服机构动作的锁定及解除锁定,具有体积小、功率大、集成度高特点;实验结果表明,在保证通信稳定的前提下,通信波特率可达2 Mbit/s ,总功率可达1 600 W,满足任务要求。     

基于UV光谱技术的高压电晕放电检测

通过分析高压电晕放电的光谱特性，提出应用紫外光+可见光的双光谱实时视频图像处理系统来探测高压电晕放电.该双光谱系统以高性能数字信号处理器TMS320DM642为核心，为了采集紫外信号而设计了光路、光谱转换和图像增强等技术,同时采用多种优化设计的硬件结构、快速融合算法及管理多进程的嵌入式实时操作系统DSP/BIOS，实现具备手动像素平移配准功能的双通道数字图像的实时融合处理.系统可以实时检测和定位高压电晕放电紫外信号，且具有响应速度快、作用距离远、不受日光和雨雾的干扰等优点.